package random;

import java.util.Stack;

/**
 * 用栈实现队列
 *
 * 请你仅使用两个栈实现先入先出队列。队列应当支持一般队列的支持的所有操作（push、pop、peek、empty）
 */


public class L232 {

    public static void main(String[] args) {
        MyQueue myQueue = new MyQueue();
        myQueue.push(1);
        myQueue.push(2);
    /*    int peek = myQueue.peek();
        int pop = myQueue.pop();
        boolean empty = myQueue.empty();

        System.out.println("peek:" + peek);
        System.out.println("pop:" + pop);
        System.out.println("empty:" + empty);*/
    }


    static class MyQueue{

        Stack<Integer> s1;
        Stack<Integer> s2;

        public MyQueue() {
            s1 = new Stack<>();
            s2 = new Stack<>();
        }

        public void push(int x) {

        }

    /*    public int pop() {

        }

        public int peek() {

        }

        public boolean empty() {

        }*/
    }
}
